Complete / Incomplete Hierarchical Hub Center Single Assignment Network Problem

In this paper we present the problem of designing a three level hub center network. In our network, the top level consists of a complete network where a direct link is between all central hubs.  The second and third levels consist of star networks that connect the hubs to central hubs and the demand nodes to hubs and thus to central hubs, respectively. We model this problem in an incomplete network environment. In this case, the top level is an incomplete network where the direct link between all central hubs is not necessary and may lead to lower transportation costs. We propose mixed integer programming model for these problems and conduct a computational study for these two developed models by using the CAB data.